Mean Value Analysis Approximation for Multiple Server Queueing Networks

نویسندگان

  • Ian F. Akyildiz
  • Gunter Bolch
چکیده

An approximation of mean value analysis is presented for queueing networks containing multiple server stations. The approximation is based on the estimation of the conditional marginal probabilities used by the mean residence time formula in mean value analysis. A comparison against classical mean value analysis allows us to determine the accuracy of our algorithm. In all investigated network models, the approximate results vary from the exact results by less than four percent on the average. This approximation method has all the advantages of classical mean value analysis; specifically, it is easy to implement and has a very short run time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Mean Value Analysis for Closed Queuing Networks with Multiple-Server Stations

Closed Queueing Networks are used in modeling various systems such as FMS, CONWIP Material Control, Computer/Communication Systems, and Health Care. Mean Value Analysis (MVA) is often used to compute the performance measures for these models. For networks with multiple-server stations, the exact MVA algorithm becomes computationally complex and existing approximations introduce high errors. The...

متن کامل

Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers‎

This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...

متن کامل

Mean Value Analysis for Blocking Queueing Networks

Mean value analysis is an exact solution technique for infinite capacity queueing networks and enjoyed widespread popularity during recent years. It considers the behavior of the system by stepwise increasing the number of jobs in the entire network, thus it is well-suited for the analysis of queueing networks with blocking. In this work, an approximation is introduced for the mean value analys...

متن کامل

A Universal Me Solution for an M/g/1 Queue with Vacation Periods

In this paper the information theoretic principle of Maximum Entropy (ME) is applied, as a method of inference, towards the study of the M/G/1 queueing model at equilibrium with either single or multiple server vacation periods under both exhaustive and non-exhaustive scheduling schemes. An analytic ME approximation for the characterisation of a universal form for the queue length distribution ...

متن کامل

Multiple vacation policy for MX/Hk/1 queue with un-reliable server

This paper studies the operating characteristics of an MX/Hk/1 queueing system under multiple vacation policy. It is assumed that the server goes for vacation as soon as the system becomes empty. When he returns from a vacation and there is one or more customers waiting in the queue, he serves these customers until the system becomes empty again, otherwise goes for another vacation. The brea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Perform. Eval.

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1988